The Isomap Algorithm and Topological Stability
نویسندگان
چکیده
منابع مشابه
The isomap algorithm and topological stability.
Topological Stability Tenenbaum et al. (1) presented an algorithm, Isomap, for computing a quasi-isometric, low-dimensional embedding of a set of high-dimensional data points. Two issues need to be raised concerning this work. First, the basic approach presented by Tenenbaum et al. is not new, having been described in the context of flattening cortical surfaces using geodesic distances and mult...
متن کاملThe Isomap Algorithm in Distance Geometry
The fundamental problem of distance geometry consists in finding a realization of a given weighted graph in a Euclidean space of given dimension, in such a way that vertices are realized as points and edges as straight segments having the same lengths as their given weights. This problem arises in structural proteomics, wireless sensor networks, and clock synchronization protocols to name a few...
متن کاملImproved Isomap Algorithm for Motion Analysis
Euclidean distance, Hausdorff distance and SSP distance are discussed, and SSP distance is used to improve Isomap algorithm. Two methods are put forward for improving Isomap algorithm. One is aligning input data of original Isomap algorithm, the other is modifying Isomap algorithm itself. SSP distance is used to search neighbors and compose neighborhood graph, and the plot for each dimension of...
متن کاملAn Improved Isomap Algorithm for Predicting Protein Localization
In this paper, a system based on the MDM-Isomap (Minimax Distance Metric-based neighborhood selection algorithm for Isomap) is proposed to improve the performance of protein subcellular localization prediction. First of all, the protein sequences are quantized into a high dimension space using an effective sequence encoding scheme. However, the problems caused by such representation are computa...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2002
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.295.5552.7a